|
|
BitTorrent Tracker-Less Peer Monitoring
Vaško, Martin ; Pluskal, Jan (referee) ; Polčák, Libor (advisor)
The goal of this thesis is to effectively monitor peers within BitTorrent network. This research is based on distributed hash tables, specifically MLDHT. In the last decade, focus has also been on efficiency of monitoring within network. Existing algorithms do not provide actual efficiency therefore it is recommended to introduce an estimate accuracy using Bernoulli process. The goal of monitoring is to ensure the highest success of peer search. The work focuses on designing and implementing Bernoulli process model. The measurements show that, the in-depth search (LIFO) is better in the short run. The work focuses on the efficiency of time monitoring, estimation of the peer search error and efficiency using the modeled Bernoulli process. Result of this work is the recommended monitoring time with high efficiency.
|
|
|
Analyzing BitTorrent Behavior
Horáček, Pavel ; Grégr, Matěj (referee) ; Matoušek, Petr (advisor)
This thesis is focused on analysis of the BitTorrent network, from theoretical view point by analyzing protocols used by this network, as well as practical view by inspecting individual clients implementing these protocols. The aim of this thesis was to develop a monitoring method used to detect communication used by this network. Due to possible illegal data sharing as well as unwanted usage of the network bandwidth, it's important for network administrators to detect this kind of communication. Another aim of this thesis was to familiarize the reader with real communication used by clients that implement protocols used in the BitTorrent network. This thesis contains descriptions of individual phases used in three selected clients, as well as three experiments performed with one of these clients.
|
|
|
BitTorrent Tracker-Less Peer Monitoring
Vaško, Martin ; Pluskal, Jan (referee) ; Polčák, Libor (advisor)
The goal of this thesis is to effectively monitor peers within BitTorrent network. This research is based on distributed hash tables, specifically MLDHT. In the last decade, focus has also been on efficiency of monitoring within network. Existing algorithms do not provide actual efficiency therefore it is recommended to introduce an estimate accuracy using Bernoulli process. The goal of monitoring is to ensure the highest success of peer search. The work focuses on designing and implementing Bernoulli process model. The measurements show that, the in-depth search (LIFO) is better in the short run. The work focuses on the efficiency of time monitoring, estimation of the peer search error and efficiency using the modeled Bernoulli process. Result of this work is the recommended monitoring time with high efficiency.
|
guest ::
